GENERATORS OF THE EISENSTEIN–PICARD MODULAR GROUP
نویسندگان
چکیده
منابع مشابه
Generators of a Picard Modular Group in Two Complex Dimensions
The goal of the article is to prove that four explicitly given transformations, two Heisenberg translations, a rotation and an involution generate the Picard modular group with Gaussian integers acting on the two dimensional complex hyperbolic space. The result answers positively a question raised by A. Kleinschmidt and D. Persson.
متن کاملGenerators for the Euclidean Picard Modular Groups
The goal of this article is to show that five explicitly given transformations, a rotation, two screw Heisenberg rotations, a vertical translation and an involution generate the Euclidean Picard modular groups with coefficient in the Euclidean ring of integers of a quadratic imaginary number field. We also obtain a presentation of the isotropy subgroup fixing infinity by analysis of the combina...
متن کاملSmall generators of the ideal class group
Assuming the Generalized Riemann Hypothesis, Bach has shown that the ideal class group C K of a number field K can be generated by the prime ideals of K having norm smaller than 12 ( log |Discriminant(K)| )2 . This result is essential for the computation of the class group and units of K by Buchmann’s algorithm, currently the fastest known. However, once C K has been computed, one notices that ...
متن کاملPseudorandom Bit Generators That Fool Modular Sums
We consider the following problem: for given n,M , produce a sequence X1, X2, . . . , Xn of bits that fools every linear test modulo M . We present two constructions of generators for such sequences. For every constant prime power M , the first construction has seed length OM (log(n/2)), which is optimal up to the hidden constant. (A similar construction was independently discovered by Meka and...
متن کاملThe Characteristic Generators for a Group Code
In this letter, we discussed some properties of characteristic generators for a finite Abelian group code, proved that any two characteristic generators can not start (end) at the same position and have the same order of the starting (ending) components simultaneously, and that the number of all characteristic generators can be directly computed from the group code itself. These properties are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 2011
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788712000018